Many to Many Matching with Demands and Capacities
نویسندگان
چکیده
Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′ j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an upper bound for this problem using our new polynomial time algorithm.
منابع مشابه
A new algorithm for Many to Many Matching with Demands and Capacities
Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} with s+r = n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem.
متن کاملA Benders Decomposition Method to Solve an Integrated Logistics Network Designing Problem with Multiple Capacities
In this paper, a new model is proposed for the integrated logistics network designing problem. In many research papers in this area, it is assumed that there is only one option for the capacity of each facility in the network. However, this is not a realistic assumption because generally there may be many possible options for the capacity of the facility that is being established. Usually the c...
متن کاملAlgorithms for Pareto Stable Assignment
Motivated by online matching marketplaces, we study stability in a many-to-many market with ties and incomplete preference lists. When preference lists contain ties, stable matchings need not be Pareto optimal. We consider the algorithmic question of computing outcomes that are both Pareto optimal and stable in a many-to-many two-sided market with ties and incomplete lists, where agents on both...
متن کاملAn O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension
Given two point sets S and T , we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given number of the points of the other set (each point has a demand). In this paper we consider a special case of MMD problem, the one-dimensional MMD (OMMD), where...
متن کاملA Fully Integrated Approach for Better Determination of Fracture Parameters Using Streamline Simulation; A gas condensate reservoir case study in Iran
Many large oil and gas fields in the most productive world regions happen to be fractured. The exploration and development of these reservoirs is a true challenge for many operators. These difficulties are due to uncertainties in geological fracture properties such as aperture, length, connectivity and intensity distribution. To successfully address these challenges, it is paramount to im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.3482 شماره
صفحات -
تاریخ انتشار 2013